Hamiltonicity of graphs perturbed by a random geometric graph
نویسندگان
چکیده
We study Hamiltonicity in graphs obtained as the union of a deterministic $n$-vertex graph $H$ with linear degrees and $d$-dimensional random geometric $G^d(n,r)$, for any $d\geq1$. obtain an asymptotically optimal bound on minimum $r$ which a.a.s. $H\cup G^d(n,r)$ is Hamiltonian. Our proof provides time algorithm to find Hamilton cycle such graphs.
منابع مشابه
Hamiltonicity of the random geometric graph
Let X1, . . . , Xn be independent, uniformly random points from [0, 1] . We prove that if we add edges between these points one by one by order of increasing edge length then, with probability tending to 1 as the number of points n tends to ∞, the resulting graph gets its first Hamilton cycle at exactly the same time it loses its last vertex of degree less than two. This answers an open questio...
متن کاملSharp threshold for hamiltonicity of random geometric graphs
We show for an arbitrary lp norm that the property that a random geometric graph G(n, r) contains a Hamiltonian cycle exhibits a sharp threshold at r = r(n) = √ log n αpn , where αp is the area of the unit disk in the lp norm. The proof is constructive and yields a linear time algorithm for finding a Hamiltonian cycle of G(n, r) a.a.s., provided r = r(n) ≥
متن کاملRobust Hamiltonicity of random directed graphs
In his seminal paper from 1952 Dirac showed that the complete graph on n ≥ 3 vertices remains Hamiltonian even if we allow an adversary to remove bn/2c edges touching each vertex. In 1960 Ghouila-Houri obtained an analogue statement for digraphs by showing that every directed graph on n ≥ 3 vertices with minimum inand out-degree at least n/2 contains a directed Hamilton cycle. Both statements q...
متن کاملHamiltonicity of random graphs produced by 2-processes
Suppose that a random graph begins with n isolated vertices and evolves by edges being added at random, conditional upon all vertex degrees being at most 2. The final graph is usually 2-regular, but is not uniformly distributed. Some properties of this final graph are already known, but the asymptotic probability of being a Hamilton cycle was not known. We answer this question along with some r...
متن کاملLong paths and Hamiltonicity in random graphs
We discuss several classical results about long paths and Hamilton cycles in random graphs and present accessible versions of their proofs, relying on the Depth First Search (DFS) algorithm and the notion of boosters.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2022
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22901